Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
701	Progress on the Complexity of Counting Problems Jin-Yi Cai University of Wisconsin, Madison Asian Association for Algorithms and Computation Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2010-12-31 10:46:04 Graph theory NP-complete problems Complexity classes Morphisms Graph coloring Graph homomorphism Matching P versus NP problem Vertex cover Theoretical computer science Mathematics Computational complexity theory
702	Proving Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison May 30, 2009 Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2010-12-31 10:44:44 Graph homomorphism Matching 2-satisfiability Bipartite graph Counting problem Constraint satisfaction problem Holographic algorithm Graph NP-complete Theoretical computer science Mathematics Graph theory
703	Graph Homomorphisms with Complex Values: A Complete Dichotomy Theorem Jin-Yi Cai University of Wisconsin, Madison Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2011-07-14 02:22:40 Graph theory NP-complete problems Graph coloring Constraint programming Complexity classes 2-satisfiability Graph homomorphism NP-complete Matching Theoretical computer science Mathematics Computational complexity theory
704	Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2011-07-11 20:52:11 Graph theory Computational problems NP-complete problems Constraint programming Graph coloring 2-satisfiability NP-complete Graph homomorphism Constraint satisfaction problem Theoretical computer science Mathematics Computational complexity theory
705	Graph Homomorphisms with Complex Values: A Dichotomy Theorem Jin-Yi Cai∗ Xi Chen† Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2011-07-11 20:49:41 Computational problems NP-complete problems Graph coloring Field theory Matroid theory Tutte polynomial Connectivity Polynomial Algebraic number field Mathematics Graph theory Theoretical computer science
706	Approximation and Hardness Results for Label Cut and Related Problems Peng Zhang ∗ Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2008-02-10 09:20:05 NP-complete problems Combinatorial optimization Maximum flow problem Graph coloring Cut Minimum k-cut Optimization problem Max-flow min-cut theorem Set cover problem Theoretical computer science Mathematics Graph theory
707	Behav Ecol Sociobiol[removed]:451–460 DOI[removed]s00265[removed]ORIGINAL PAPER Shape and efficiency of wood ant foraging networks Add to Reading List Source URL: www.collective-behavior.com Language: English - Date: 2014-06-04 01:02:14 Symbiosis NP-complete problems Myrmicinae Steiner tree problem Ant colony optimization algorithms Atta Ant Travelling salesman problem Minimum spanning tree Graph theory Theoretical computer science Mathematics
708	Backward Induction is PTIME-complete Jakub Szymanik∗ Institute of Logic Language and Computation, University of Amsterdam [removed] Abstract. We prove that the computational problem of finding backward induc Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2013-07-13 09:14:28 Complexity classes Finite model theory Graph connectivity Game theory FO Reachability P Extensive-form game Tree Theoretical computer science Graph theory Mathematics

UPDATE